A Heuristic Lazy Bayesian Rule Algorithm
نویسندگان
چکیده
LBR has demonstrated outstanding classification accuracy. However, it has high computational overheads when large numbers of instances are classified from a single training set. We compare LBR and the tree-augmented Bayesian classifier, and present a new heuristic LBR classifier that combines elements of the two. It requires less computation than LBR, but demonstrates similar prediction accuracy.
منابع مشابه
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complexity of attribute-value pair selection is quadratic to the number of attributes. This fact incurs high computational costs, especially for datasets of high dimensionality. To solve the problem, this paper proposes an ef...
متن کاملLearning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algorithm learns Markov blanket models, carries out Bayesian model averaging over a set of models to predict a target variable of the instance at hand, and employs an instance-specific heuristic to locate a set of suitable m...
متن کاملLazy Bayesian Rules
The naive Bayesian classiier provides a simple and eeective approach to classiier learning, but its attribute independence assumption is often violated in the real world. A number of approaches have sought to alleviate this problem. A Bayesian tree learning algorithm builds a decision tree, and generates a local naive Bayesian classiier at each leaf. The tests leading to a leaf can alleviate at...
متن کاملLearning Lazy Rules to Improve the Performance of Classiiers
Based on an earlier study on lazy Bayesian rule learning, this paper introduces a general lazy learning framework, called LazyRule, that begins to learn a rule only when classifying a test case. The objective of the framework is to improve the performance of a base learning algorithm. It has the potential to be used for diierent types of base learning algorithms. LazyRule performs attribute eli...
متن کاملLearning Lazy Rules to Improvethe Performance of Classi ersKai
Based on an earlier study on lazy Bayesian rule learning, this paper introduces a general lazy learning framework, called LazyRule, that begins to learn a rule only when classifying a test case. The objective of the framework is to improve the performance of a base learning algorithm. It has the potential to be used for diierent types of base learning algorithms. LazyRule performs attribute eli...
متن کامل